Creating Slides from Video Lecture

نویسندگان

چکیده

Introduction. Video recordings of lectures are no longer a rarity in the conditions distance learning. Videos may be an inconvenient format for students or contain different artifacts due to compression, camera quality, and other factors. It is useful have presentation study material, which contains only text from board because such view material most like compendium. Purpose. The item our work creating algorithm obtaining panorama slides without teacher video lecture. To develop this algorithm, we use Boykov-Kolmogorov Max-flow mask moving objects. In some lectures, moved so that sight, not visible. do this, make frames stitching get panorama. reduce duplication shaking, perform video-stabilization as preprocessing step, then replace pixels using mask. Finally, create by comparing changes frames, binarizingand denoising. Methods. We used SIFT, Laplace operator Otsu binarization developing information technology. Results.As result, with extracted drawings board, will help simplify creation e-learning materials both new existing lecture recordings. Teachers also able quickly provide even if they teach several complex subjects. Conclusion. developed implemented technology video-lecture. Now, can give short content material. next steps automatic detection division into sections, recognition formulas written on board.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lecture Slides

Consider the initial value problem u = f (u, t), u(t 0) = u 0 An mth order system of s equations can be reduced to a system of ms first order equations, by introducing new variables v 1 = u , v 2 = u ,. .. , v m−1 = u (m−1). The explicit time-dependency can be removed by introducing a new variable w = t with the trivial equation w = 1, to obtain a new autonomous system of equations A linear sys...

متن کامل

Lecture Slides

This paper describes an efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane. The algorithm may be viewed as an iterative version of a method originally proposed by Auslander and Parter and correctly formulated by Goldstein. The algorithm uses depth-first search and has O(V) time and space bounds, where V is the number of vertices in G. An ALGOS implementat...

متن کامل

Lecture 9 slides: Testing concepts

Example For example, let X 2 1, ..., Xn be a random sample from distribution N(μ, σ ) with σ known and μ ∈ M. Suppose our hypothesis is that μ ∈ M1 for some M1 ⊂ M, i.e. M1 is some subset of M. It is called the null hypothesis. It is denoted as H0 : μ ∈ M1. Then the alternative hypothesis is that μ ∈/ M1, i.e. μ ∈ M\M1. It is denoted as Ha : μ ∈/ M\M1. For example, if M1 = μ0 and M = {μ : μ ≥ μ...

متن کامل

Lecture 12 slides: Confidence sets

So far, we have been considering point estimation. In this lecture, we will study interval estimation. Let X denote our data. Let θ ∈ R be our parameter of interest. Our task is to construct a data-dependent interval [l(X), r(X)] so that it contains θ with large probability. One possibility is to set l(X) = −∞ and r(X) = +∞. Such an interval will contain θ with probabity 1. Of course, the probl...

متن کامل

Lecture 5 slides: Point estimators

Let X be our data. Let θ̂ = T (X) be an estimator where T is some function. We say that θ̂ is unbiased for θ if Eθ[T (X)] = θ for all possible values of θ where Eθ denotes the expectation when θ is the true parameter value. Thus, the concept of unbiasness means that we are on average right. The bias of θ̂ is de ned by Bias(θ̂) = Eθ[θ̂] − θ. Thus, θ̂ is unbiased if and only if its bias equals 0. For e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Control systems and computers

سال: 2022

ISSN: ['2706-8145', '2706-8153']

DOI: https://doi.org/10.15407/csc.2022.02.003